A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems
نویسندگان
چکیده
This paper studies a 4-approximation algorithm for k-prize collecting Steiner tree problems. This problem generalizes both k-minimum spanning tree problems and prize collecting Steiner tree problems. Our proposed algorithm employs two 2-approximation algorithms for k-minimum spanning tree problems and prize collecting Steiner tree problems. Also our algorithm framework can be applied to a special case of k-prize collecting traveling salesman problems.
منابع مشابه
Prize-Collecting Steiner Tree and Forest in Planar Graphs
We obtain polynomial-time approximation-preserving reductions (up to a factor of 1+ε) from the prizecollecting Steiner tree and prize-collecting Steiner forest problems in planar graphs to the corresponding problems in graphs of bounded treewidth. We also give an exact algorithm for the prize-collecting Steiner tree problem that runs in polynomial time for graphs of bounded treewidth. This, com...
متن کاملApproximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs
Abstract. We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for planar NWPCST. We then show a (2.88+ǫ)-approximation which establishes a new best approximation guarantee for planar NWPCST. This is done by combining our LMP algorithm with ...
متن کاملA note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem
The primal-dual scheme has been used to provide approximation algorithms for many problems. Goemans and Williamson gave a (2− 1 n−1 )-approximation for the Prize-Collecting Steiner Tree Problem that runs in O(n logn) time. Johnson, Minkoff and Phillips proposed a faster implementation of Goemans and Williamson’s algorithm. We give a proof that the approximation ratio of this implementation is e...
متن کاملElementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G= (V ,E), a collection T = {T1, . . . , Tk}, each a subset of V of size at least 2, a weight function w :E → R+, and a penalty function p :T → R+. The goal is to find a forest F that minimizes the cost of the edges of F plus the penalt...
متن کاملPrize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network design problem. We show as an structural result that in each iteration of our algorithm there is an LP variable in a basic feasible solution which is at least one-third-integral resulting a 3-approximation algorithm for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1802.06564 شماره
صفحات -
تاریخ انتشار 2018